Gradient based variable forgetting factor RLS algorithm

نویسندگان

  • C. F. So
  • Sin Chun Ng
  • Shu Hung Leung
چکیده

The recursive least squares (RLS) algorithm is well known for its good convergence property and small mean square error in stationary environments. However RLS using constant forgetting factor cannot provide satisfactory performance in time varying environments. In this seminar, three variable forgetting factor (VFF) adaptation schemes for RLS are presented in order to improve the tracking performance and mean square error of the RLS algorithm in nonstationary environment. Based on the dynamic equation of the improved mean square error analysis, a gradient based adaptation of forgetting factor is derived. The resulting variable forgetting factor scheme can reduce the forgetting factor when large model error is detected and increase the forgetting factor when the model error becomes small. Simulation results shown that these algorithms can yield fast tracking and small mean square model error in different noise environments. Brief Biography Mr. So graduated in BEng(Hon) Computer Engineering in 1999 and continued to pursue a master degree all in Department of Electronic Engineering, City University of Hong Kong. His research interest is on adaptive filter theory, detection and estimation. Date : March 7, 2002 (Thursday) Time : 2:30pm 3:30pm Venue : G6302, Green Zone, Lift No. 7 City University of Hong Kong ** ALL ARE WELCOME ** This seminar will be chaired by Dr. S H Leung, Department of Electronic Engineering, City University of Hong Kong.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detecting Mean Reverted Patterns in Statistical Arbitrage

Outline Motivation / algorithmic pairs trading Model setup Detection of local mean-reversion Adaptive estimation 1. RLS with gradient variable forgetting factor 2. RLS with Gauss-Newton variable forgetting factor 3. RLS with beta-Bernoulli forgetting factor Trading strategy Pepsi and Coca Cola example Introduction Statistical arbitrage. Algorithmic pairs trading market neutral trading. Buy low,...

متن کامل

A Novel Forgetting Factor Recursive Least Square Algorithm Applied to the Human Motion Analysis

This paper is concerned with studying the forgetting factor of the recursive least square (RLS). A new dynamic forgetting factor (DFF) for RLS algorithm is presented. The proposed DFF-RLS is compared to other methods. Better performance at convergence and tracking of noisy chirp sinusoid is achieved. The control of the forgetting factor at DFF-RLS is based on the gradient of inverse correlation...

متن کامل

RLS Algorithm with Variable Forgetting Factor for Decision Feedback Equalizer over Time-Variant Fading Channels

In a high-rate indoor wireless personal communication system, the delay spread due to multipath propagation results in intersymbol interference (ISI) which can signi cantly increase the transmission bit error rate (BER). Decision feedback equalizer (DFE) is an e cient approach to combating the ISI. Recursive least squares (RLS) algorithm with a constant forgetting factor is often used to update...

متن کامل

RLS Algorithm with Variable Fogetting Factor for Decision Feedback Equalizer over Time-Variant Fading Channels

In a high-rate indoor wireless personal communication system, the delay spread due to multipath propagation results in intersymbol interference (ISI) which can significantly increase the transmission bit error rate (BER). Decision feedback equalizer (DFE) is an efficient approach to combating the ISI. Recursive least squares (RLS) algorithm with a constant forgetting factor is often used to upd...

متن کامل

Convex Combination of Two Recursive Least Squares-type Algorithms for Adaptive Whitening

The recursive least squares (RLS)-type whitening algorithm is shown to be a useful solution for improving the convergence rate of the least mean square (LMS)-type whitening algorithm, but the RLStype algorithm with a constant forgetting factor requires a tradeoff between the convergence speed and steady-state misadjustment. By using a convex combination of two RLS algorithms with different forg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Signal Processing

دوره 83  شماره 

صفحات  -

تاریخ انتشار 2003